On the Convergence of the Pairwise Comparisons Inconsistency Reduction Process

نویسندگان

  • Waldemar W. Koczkodaj
  • Jacek Szybowski
چکیده

This study investigates a powerful model, targeted to subjective assessments, based on pairwise comparisons. It provides a proof that a distance-based inconsistency reduction transforms an inconsistent pairwise comparisons (PC) matrix into a consistent PC matrix which is generated by the geometric means of rows of a given inconsistent PC matrix. The distance-based inconsistency indicator was defined in 1993 for pairwise comparisons. Its convergence was analyzed in 1996 (regretfully, with an incomplete proof; finally completed in 2010). However, there was no clear interpretation of the convergence limit which is of considerable importance for applications and this study does so. This study finally ends the ongoing (since 1984) dispute on the approximation method for the inconsistent pairwise comparisons. The convergence limit is the vector of geometric means. It is not the principal right eigenvector of a given PC matrix.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Convergence of Distance-based Inconsistency in Pairwise Comparisons

This study presents theoretical proof and empirical evidence of the reduction algorithm convergence for the distance-based inconsistency in pairwise comparisons. Our empirical research shows that the convergence very quick. It usually takes less than 10 reductions to bring the inconsistency of the pairwise comparisons matrix below the assumed threshold of 1/3 (sufficient for most applications)....

متن کامل

Convergence of Inconsistency Algorithms for the Pairwise Comparisons

A formal proof of convergence of a class of algorithms for reducing inconsistency of pairwise comparisons (PC) method is presented. The design of such algorithms is proposed. The convergence of the algorithms justifies making an inference that iterated modifications of the pc matrix made by human experts should also converge. This is instrumental for credibility of practical applications of the...

متن کامل

Empirical Software Engineering Approach to the Distance-based Inconsistency for Pairwise Comparisons

This study presents empirical evidence of the fast convergence of the distance-based inconsistency for pairwise comparisons. It is a follow up of the theoretical proof of the inconsistency convergence. The convergence has been proven by the functional analysis method. As most mathematical proofs, computing the number of iterations has not even been considered. Our empirical research shows that ...

متن کامل

On distance-based inconsistency reduction algorithms for pairwise comparisons

One of the major challenges for collective intelligence is inconsistency, which is unavoidable whenever subjective assessments are involved. Pairwise comparisons allow one to represent such subjective assessments and to process them by analyzing, quantifying and identifying the inconsistencies. We propose using smaller scales for pairwise comparisons and provide mathematical and practical justi...

متن کامل

On Axiomatization of Inconsistency Indicators for Pairwise Comparisons

This study examines the notion of inconsistency in pairwise comparisons for providing an axiomatization for it. It also proposes two inconsistency indicators for pairwise comparisons. The primary motivation for the inconsistency reduction is expressed by a computer industry concept “garbage in, garbage out”. The quality of the output depends on the quality of the input.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1505.01325  شماره 

صفحات  -

تاریخ انتشار 2015